Counterexample Classification

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Akizuki's Counterexample

Following [Akizuki], I construct a Noetherian local integral domain CM whose normalisation (integral closure) is not finite over CM . My proof follows closely Akizuki’s ingenious calculations. Let A be a DVR with local parameter t and residue field k = A/(t), and  the completion of A. There are no restrictions on the characteristic of A or k, but I assume that  contains a transcendental eleme...

متن کامل

Counterexample-Guided Precondition Inference

The precondition for an assertion within a procedure is useful for understanding, verifying and debugging programs. As the procedure might be used in multiple calling-contexts within the program, the precondition should be sufficiently precise to enable re-use. We present an extension of counterexample-guided abstraction refinement (CEGAR) for automated precondition inference. Starting with an ...

متن کامل

Counterexample Guided Inductive Optimization

This paper describes three variants of a counterexample guided inductive optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT) solvers. In particular, CEGIO relies on iterative executions to constrain a verification procedure, in order to perform inductive generalization, based on counterexamples extracted from SMT solvers. CEGIO is able to successfully optimize a wide ran...

متن کامل

Counterexample-Driven Model Checking

The generation of counterexamples is frequently touted as one of the primary advantages of model checking as a verification technique. However, the generation of trace-like counterexamples is limited to a small fragment of branching-time temporal logic. When model checking does succeed in verifying a property, there is typically no independently checkable witness that can be used as evidence fo...

متن کامل

Counterexample-Guided Control

A major hurdle in the algorithmic veri cation and control of systems is the need to nd suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the speci cation. The paradigm of counterexample-guided abstraction re nement suggests a fully automatic way of nding suitable abstr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-92124-8_18